Combating Reinforcement Learning's Sisyphean Curse with Intrinsic Fear

نویسندگان

  • Zachary C. Lipton
  • Jianfeng Gao
  • Lihong Li
  • Jianshu Chen
  • Li Deng
چکیده

To use deep reinforcement learning in the wild, we might hope for an agent that would never make catastrophic mistakes. At the very least, we could hope that an agent would eventually learn to avoid old mistakes. Unfortunately, even in simple environments, modern deep reinforcement learning techniques are doomed by a Sisyphean curse. Owing to the use of function approximation, these agents eventually forget experiences as they become exceedingly unlikely under a new policy. Consequently, for as long as they continue to train, state-aggregating agents may periodically relive catastrophic mistakes. We demonstrate unacceptable performance of deep Q-networks on two toy problems. We then introduce intrinsic fear, a method that mitigates these problems by avoiding dangerous states.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Combating Deep Reinforcement Learning’s Sisyphean Curse with Intrinsic Fear

To use deep reinforcement learning in the wild, we might hope for an agent that can avoid catastrophic mistakes. Unfortunately, even in simple environments, the popular deep Q-network (DQN) algorithm is doomed by a Sisyphean curse. Owing to the use of function approximation, these agents eventually forget experiences as they become exceedingly unlikely under a new policy. Consequently, for as l...

متن کامل

The Parti - Game Algorithm

Parti-game is a new algorithm for learning feasible trajectories to goal regions in high dimensional continuous state-spaces. In high dimensions it is essential that learning does not plan uniformly over a state-space. Parti-game maintains a decision-tree partitioning of state-space and applies techniquesfrom game-theoryand computational geometryto eeciently and adaptively concentrate high reso...

متن کامل

Application of reinforcement learning to the game of Othello

Operations research and management science are often confronted with sequential decision making problems with large state spaces. Standard methods that are used for solving such complex problems are associated with some difficulties. As we discuss in this article, these methods are plagued by the so-called curse of dimensionality and the curse of modelling. In this article, we discuss reinforce...

متن کامل

Hierarchical Reinforcement Learning in Robot Control

The use of reinforcement learning in robotics suffers greatly from the curse of dimensionality, stemming from the necessity of a high DOF in a robot to solve even the simplest tasks. This paper gives an overview over several attempts to decrease this problem using a hierarchical structure of reinforcement learning, an evaluation of the problems that arise with such approaches and possible solut...

متن کامل

A Comparison of Reinforcement

Reinforcement learning is a computational approach to learning from interaction. Tab-ular implementations of reinforcement learning methods are the most simple, though, they suuer from the curse of dimensionality problem; therefore, function approximation techniques have been used to provide generalization across states and actions. Nevertheless , eligibility traces and integrated learning, pla...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1611.01211  شماره 

صفحات  -

تاریخ انتشار 2016